A Courteous Learning Rule for Ad-hoc Anti-coordination
نویسندگان
چکیده
In this paper, we investigate the problem of anti-coordination under rationality constraints in ad-hoc resource allocation settings. Inspired by human behavior, we propose a framework (CA3NONY ) that enables fast convergence to efficient and fair allocations based on a simple convention of courtesy. We prove that following such convention induces a strategy which constitutes an approximate subgame-perfect equilibrium of the repeated resource allocation game with discounting. Simulation results highlight the effectiveness of CA3NONY as compared to state-of-the-art bandit algorithms, since it achieves more than two orders of magnitude faster convergence, higher efficiency, fairness, and average payoff for the agents.
منابع مشابه
Creating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملCreating Dynamic Sub-Route to Control Congestion Based on Learning Automata Technique in Mobile Ad Hoc Networks
Ad hoc mobile networks have dynamic topology with no central management. Because of the high mobility of nodes, the network topology may change constantly, so creating a routing with high reliability is one of the major challenges of these networks .In the proposed framework first, by finding directions to the destination and calculating the value of the rout the combination of this value with ...
متن کاملMulti-agent learning in mobilized ad-hoc networks
In large, distributed systems such as mobilized ad-hoc networks, centralized learning of routing or movement policies may be impractical. We need to employ multi-agent learning algorithms that can learn independently, without the need for extensive coordination. Using only a simple coordination signals such as a global reward value, we show that reinforcement learning methods can be used to con...
متن کاملA Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کاملLearning Teammate Models for Ad Hoc Teamwork
Robust autonomous agents should be able to cooperate with new teammates effectively by employing ad hoc teamwork. Reasoning about ad hoc teamwork allows agents to perform joint tasks while cooperating with a variety of teammates. As the teammates may not share a communication or coordination algorithm, the ad hoc team agent adapts to its teammates just by observing them. Whereas most past work ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1801.07140 شماره
صفحات -
تاریخ انتشار 2018